Size, constant sequences, and optimal selection.

نویسندگان

  • Michal Legiewicz
  • Catherine Lozupone
  • Rob Knight
  • Michael Yarus
چکیده

Because the abundance of functional molecules in RNA sequence space has many unexplored aspects, we compared the outcome of 11 independent selections, performed using the same affinity selection protocol and contiguous randomized regions of 16, 22, 26, 50, 70, and 90 nucleotides. All affinity selections targeted the simplest isoleucine aptamer, an asymmetric internal loop. This loop should be abundant in all selections, so that it can be compared across all experiments. In some cases, two primer sets intended to favor selection of different structures have also been compared. The simplest isoleucine aptamer dominates all selections except with the shortest tract, 16 contiguous randomized nucleotides. Here the isoleucine aptamer cannot be accommodated and no other motif can be selected. Our results suggest an optimum length for selection; surprisingly, both the shortest and the longest randomized tracts make it more difficult to recover the motif. Estimated apparent initial abundances suggest that the simplest isoleucine motif was 20- to 40-fold more frequent in selection with 50- or 70-nucleotide randomized regions than with any other length. Considering primer sets, a pre-formed stable stem within fixed flanking sequences had a five-to 10-fold negative effect on apparent motif abundance at all lengths. Differing random tract lengths also determined the probable motif permutation and the most abundant helix lengths. These data support a significant but lesser role for primer sequences in the outcome of selections.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

متن کامل

Perspective on Possible Recombination Event in Fusion Protein Gene of Newcastle Disease Viruses Isolated in Iran

Background and Aims: Newcastle disease (ND), caused by the virulent Newcastle disease virus (NDV), is one of the most important viral diseases in birds. In recent years recombination occurring throughout the NDVs genome isolated in China and Indonesia has been reported. This study was focused to investigate the recombination events in the F gene of the Iranian NDVs to generate useful data that ...

متن کامل

Optimal Mutation Rate Control under Selection in Hamming Spaces

We investigate the effect of selection in a meta-genetic algorithm designed to optimize mutation rate control, based on the fitness of sequences relative to a defined optimum, in asexual evolution. Multiple innovations in the algorithm are required to achieve the evolution of optimal mutation rate control under selection. Before implementing selection, results from this improved algorithm clari...

متن کامل

A Single Supplier Procurement Model With Random Yield

In this paper, we develop a procedure for selecting a supplier. Suppliers are characterized by their lead time, price and quality (random yield). Each purchased item is acceptable with a given probability and independent of the others. We assume the demands are deterministic with no set-up cost and backordering is allowed. For each supplier, an optimal ordering policy is developed. We prove the...

متن کامل

Optimal Non-Parametric Prediction Intervals for Order Statistics with Random Sample Size

‎ In many experiments, such as biology and quality control problems, sample size cannot always be considered as a constant value. Therefore, the problem of predicting future data when the sample size is an integer-valued random variable can be an important issue. This paper describes the prediction problem of future order statistics based on upper and lower records. Two different cases for the ...

متن کامل

On Bottleneck Product Rate Variation Problem with Batching

The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • RNA

دوره 11 11  شماره 

صفحات  -

تاریخ انتشار 2005